The Independence Property of a Class of Set Constraints
نویسندگان
چکیده
We investigate a class of set constraints that is used for the type analysis of concurrent constraint programs. Its constraints are inclusions between rst-order terms (without set operators) interpreted over non-empty sets of nite trees. We show that this class has the independence property. We give a polynomial algorithm for entailment. The independence property is a fundamental property of constraint systems. It says that the constraints cannot express disjunctions, or, equivalently, that negated conjuncts are independent from each other. As a consequence, the satissability of constraints with negated conjuncts can be directly reduced to entailment.
منابع مشابه
Characterization of weak fixed point property for new class of set-valued nonexpansive mappings
In this paper, we introduce a new class of set-valued mappings which is called MD-type mappings. This class of mappings is a set-valued case of a class of the D-type mappings. The class of D-type mappings is a generalization of nonexpansive mappings that recently introduced by Kaewkhao and Sokhuma. The class of MD-type mappings includes upper semi-continuous Suzuki type mappings, upper semi-con...
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملSet Constraints with Intersection
Set constraints are inclusions between expressions denoting sets of trees. The eficiency of their satisfiabili ty test is a central issue in set-based program analysis, their main application domain. W e introduce the class of set constraints with intersection (the only operators forming the expressions are constructors and intersection) and show that i ts satisfiability problem as DEXPTIME-com...
متن کاملLIMIT AVERAGE SHADOWING AND DOMINATED SPLITTING
In this paper the notion of limit average shadowing property is introduced for diffeomorphisms on a compact smooth manifold M and a class of diffeomorphisms is given which has the limit average shadowing property, but does not have the shadowing property. Moreover, we prove that for a closed f-invariant set Lambda of a diffeomorphism f, if Lambda is C1-stably limit average shadowing and t...
متن کاملAsymptotic behaviour of associated primes of monomial ideals with combinatorial applications
Let $R$ be a commutative Noetherian ring and $I$ be an ideal of $R$. We say that $I$ satisfies the persistence property if $mathrm{Ass}_R(R/I^k)subseteq mathrm{Ass}_R(R/I^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{Ass}_R(R/I)$ denotes the set of associated prime ideals of $I$. In this paper, we introduce a class of square-free monomial ideals in the polynomial ring $R=K[x_1,ld...
متن کامل